Appropriate Steps A Theory of Motivated Proofs

نویسنده

  • Rebecca Morris
چکیده

While philosophers have long been interested in proofs, their primary focus has traditionally been on the justificational role that they play, and particularly on the certainty that they provide. Mathematicians throughout history, however, have expected proofs to do more than “just” establish a certain result. For example, mathematicians have especially valued proofs which are fruitful, obtained in a pure manner, or explanatory. Philosophers of mathematical practice have recently started to investigate such non-justificational aspects of proofs. In this dissertation, I explore another desideratum taken from the practice of mathematics: that proofs be motivated. The topic of motivated proofs has received some discussion by mathematicians, most notably George Pólya, who emphasized that the steps in a motivated proof must not only be correct, but also appropriate, and recognized as such by the reader. However, the topic of motivated proofs has received almost no philosophical attention. It might be thought that this is because such a topic is not philosophically interesting and is better investigated by other disciplines such as psychology or pedagogy. However, while I encourage a highly interdisciplinary approach, I argue that the topic is philosophically interesting and requires philosophical work, even for it to be fruitfully studied from within a different discipline. Throughout the rest of this dissertation, I undertake such philosophical work. More precisely, I address philosophical questions such as “What criteria should a proof meet to be motivated?”, and “Should obtaining motivated proofs be a mathematical goal?” In addition I tackle the more practical question, “How can a poorly motivated proof be transformed into a better motivated one?”

منابع مشابه

Verification of Proof Steps for Tutoring Mathematical Proofs

The feedback given by human tutors is strongly based on their evaluation of the correctness of student’s contributions [7]. A typical approach to verification of contributions in ITSs is model tracing, in which contributions are matched against a precomputed solution graph [1,3]. However verifying steps in mathematical theorem proving poses particular problems because there are possibly infinit...

متن کامل

Proof Step Analysis for Proof Tutoring – A Learning Approach to Granularity

We present a proof step diagnosis module based on the mathematical assistant system Ωmega. The task of this module is to evaluate proof steps as typically uttered by students in tutoring sessions on mathematical proofs. In particular, we categorise the step size of proof steps performed by the student, in order to recognise if they are appropriate with respect to the student model. We propose a...

متن کامل

Choosing appropriate theories for understanding hospital reporting of adverse drug events, a theoretical domains framework approach

Adverse drug events (ADEs) may cause serious injuries including death. Spontaneous reporting of ADEs plays a great role in detection and prevention of them, however, underreporting always exists. Although several interventions have been utilized to solve this problem, they are mainly based on experience and the rationale for choosing them has no theoretical base. The vast variety of behavioral ...

متن کامل

Choosing appropriate theories for understanding hospital reporting of adverse drug events, a theoretical domains framework approach

Adverse drug events (ADEs) may cause serious injuries including death. Spontaneous reporting of ADEs plays a great role in detection and prevention of them, however, underreporting always exists. Although several interventions have been utilized to solve this problem, they are mainly based on experience and the rationale for choosing them has no theoretical base. The vast variety of behavioral ...

متن کامل

Proof Simplification in the Framework of Coherent Logic

The problem of proof simplification draws a lot of attention to itself across various contexts. In this paper, we present one approach for simplifying proofs constructed in the framework of coherent logic. This approach is motivated by the need for filtering-out “clean” and short proofs from proof-traces, which typically contain many irrelevant steps, and which are generated by automated theore...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015